منابع مشابه
Efficient multiple genome alignment
MOTIVATION To allow a direct comparison of the genomic DNA sequences of sufficiently similar organisms, there is an urgent need for software tools that can align more than two genomic sequences. RESULTS We developed new algorithms and a software tool 'Multiple Genome Aligner' (MGA for short) that efficiently computes multiple genome alignments of large, closely related DNA sequences. For exam...
متن کاملEMAGEN: An Efficient Approach to Multiple Whole Genome Alignment
Following advances in biotechnology, many new whole genome sequences are becoming available every year. A lot of useful information can be derived from the alignment and comparison of different genomes. However, most of the current research focuses on pairwise genome alignment, and only a few available applications can efficiently align multiple genomes. In this paper, we present an efficient a...
متن کاملParallelization of Multiple Genome Alignment
In this work, we implement a genome alignment system which applies parallelization schemes to the ClustalW algorithm and the interface of database querying. Parallel construction of the distance matrices and parallelization of progressive alignment in the ClustalW algorithm are performed on PC-based Linux cluster with message-passing interface libraries. Achieved experiments show good speedup a...
متن کاملnoob: a multiple genome alignment browser
We present a multiple genome alignment browser for sequences from numerous multiple alignments. Our goal is to use information visualization to help users think about how sequences have evolved over time. Our application takes as input a series of multiple alignments in MAF format and outputs an interactive visual display of the data. 1 Information visualization Information visualization has in...
متن کاملA Prototype for Multiple Whole Genome Alignment
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several problems including decomposition of genomes with a suffix tree, finding an LIS for multiple MUM sequences, and iterative pairwise multiple sequence alignment. This results in an overall linear time complexity for our algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2002
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/18.suppl_1.s312